A true Random-Number Encryption Method employing block cipher and PRNG
نویسندگان
چکیده
In January 1999, distributed.net collaborated with the Electronic Frontier Foundation to break a DES (i.e., Data Encryption Standard) key, spending 22 hours and 15 minutes, and implying that the DES is no longer a secure encryption method. In this paper, we propose a more secure one, called the True Random Number Encryption Method (TRNEM for short), which employs current time, true random numbers and system security codes as parameters of the encryption process to increase the security level of a system. The same plaintext file encrypted by the TRNEM at different time points generates different ciphertext files. So these files are difficult to be cracked. We also analyze the security of the DES, AES (i.e., Advanced Encryption Standard) and TRNEM, and explain why the TRNEM can effectively defend some specific attacks, and why it is safer than the DES and AES.
منابع مشابه
A new method for generating key for cryptography using Deterministic random number generator
Now a day’s communication has played a key role in each and every aspect of life. In communication the main problem is security and privacy of sensitive data. The data should be transmitted from sender to receiver without any loss of original information. There are many ways of secure communication. One of those techniques is Cryptography. In cryptography there are mainly two mechanisms. They a...
متن کاملText Encryption Algorithms based on Pseudo Random Number Generator
This paper presents algorithms for encryption and decryption developed using pseudo random number generator (PRNG) and non-Linear functions. PRNG used in the work are matlab random number generator (RNG) and Linear congruential generator (LCG). The developed algorithms are named according to PRNG used in it. State of PRNG is considered as secret key of the cipher. The encryption schemes have be...
متن کاملTurbo PMC V3 – 1024 Bit Block Cipher for Storage Device Block Level Encryption
A fast and provably secure Polymorphic Block Cipher consisting of a three-round Luby Rackoff Pseudorandom Permutation Generator with a Decorrelation Stage employing a large number of interdependent pseudo-random number generators, combiner routines and permutation functions is proposed. Data-dependent selection of cryptographic primitives with a shared internal state at runtime provides a novel...
متن کاملSecurity Analysis of Generalized Confidential Modulation
We propose a new evaluation method for ‘generalized confidential modulation (GCM)’ for quantum communication. Confidential modulation realizes a secret communication by using secret information for modulation and noise in a channel. Y-00 is one of the famous methods of GCM for quantum communication. The existing evaluation methods for GCM are based on stream ciphers. They can estimate its analy...
متن کاملToward the True Random Cipher: On Expected Linear Probability Values for SPNs with Randomly Selected S-Boxes
A block cipher, which is an important cryptographic primitive, is a bijective mapping from {0, 1} to {0, 1} (N is called the block size), parameterized by a key. In the true random cipher, each key results in a distinct mapping, and every mapping is realized by some key—this is generally taken to be the ideal cipher model. We consider a fundamental block cipher architecture called a substitutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Sci. Inf. Syst.
دوره 11 شماره
صفحات -
تاریخ انتشار 2014